Barrier Methods for Optimal Control Problems with Convex Nonlinear Gradient Constraints
نویسندگان
چکیده
In this paper we are concerned with the application of interior point methods in function space to gradient constrained optimal control problems, governed by partial differential equations. We will derive existence of solutions together with first order optimality conditions. Afterwards we show continuity of the central path, together with convergence rates depending on the interior point parameter. AMS MSC 2000: 90C51, 49M05
منابع مشابه
An efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملConvergence to the optimal value for barrier methods combined with Hessian Riemannian gradient flows and generalized proximal algorithms
We consider the problem minx∈Rn{f(x) | Ax = b, x ∈ C, gj(x) ≤ 0, j = 1, . . . , s}, where b ∈ R, A ∈ R is a full rank matrix, C is the closure of a nonempty, open and convex subset C of R, and gj(·), j = 1, . . . , s, are nonlinear convex functions. Our strategy consists firstly in to introduce a barrier-type penalty for the constraints gj(x) ≤ 0, then endowing {x ∈ R | Ax = b, x ∈ C} with the ...
متن کاملGeneralized Uniformly Optimal Methods for Nonlinear Programming
In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization problems. The basic idea is to incorporate a local search step (gradient descent or Quasi-Newton iteration) into these uniformly optimal convex programming methods, and then enforce a monotone decreasing property of th...
متن کاملAlgorithms of Optimal Control Methods for Nonlinear Systems with Constraints
The contribution presents defined problems of a control of nonlinear systems, processes with constraints and limitations. Optimality conditions for a control and iterative gradient methods of nonlinear systems optimization have been given. The defined problem with the Lagrangian criterion function is converted to an optimalization problem of the theory of games. In order to solve such a problem...
متن کامل